Glioblastoma—a moving target

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quadrotor UAV Guidence For Ground Moving Target Tracking

The studies in aerial vehicles modeling and control have been increased rapidly recently. In this paper , a coordination of two types of heterogeneous robots , namely unmanned aerial vehicle (UAV) and unmanned ground vehicle (UGV) is considered. In this paper the UAV plays the role of a virtual leader for the UGVs. The system consists of a vision- based target detection algorithm that uses the ...

متن کامل

Moving target D* Lite

Incremental search algorithms, such as Generalized FringeRetrieving A* and D* Lite, reuse search trees from previous searches to speed up the current search and thus often find cost-minimal paths for series of similar search problems faster than by solving each search problem from scratch. However, existing incremental search algorithms have limitations. For example, D* Lite is slow on moving t...

متن کامل

Moving Target Selection

Target selection is a fundamental aspect of interaction and is particularly challenging when targets are moving. We address this problem by introducing a novel selection technique we call Hold which temporarily pauses the content while selection is in progress to provide a static target. By studying users, we evaluate our method against two others for acquiring moving targets in one and two dim...

متن کامل

Glioblastoma—a moving target

The slow development of effective treatment of glioblastoma is contrasted by the rapidly advancing research on the molecular mechanisms underlying the disease. Amplification and overexpression of receptor tyrosine kinases, particularly EGFR and PDGFRA, are complemented by mutations in the PI3K, RB1, and p53 signaling pathways. In addition to finding effective means to target these pathways, we ...

متن کامل

Moving Target Search

We consider the case of heuristic search where the location of the goal may change during the course of the search. For example, the goal may be a target that is actively avoiding the problem solver. We present a moving target search algorithm (MTS) to solve this problem. We prove that if the average speed of the target is slower than that of the problem solver, then the problem solver is guara...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Upsala Journal of Medical Sciences

سال: 2012

ISSN: 0300-9734,2000-1967

DOI: 10.3109/03009734.2012.676574